1437C - Chef Monocarp - CodeForces Solution

#include <bits/stdc++.h>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <algorithm>
#define inf LONG_LONG_MAX

const int mod =  1000000007;
typedef long long int ll;
using namespace std;
void fastio()
{
    cin.tie(0);
    cin.sync_with_stdio(0);

}

int solve(int i,int j,vector<int>&arr,vector<vector<int>>&dp){
    if(i>=arr.size()){
        return 0;
    }
    if(j>=400)return 1e9;
    if(dp[i][j]!=-1)return dp[i][j];
    int ans=solve(i,j+1,arr,dp);
    ans=min(ans,abs(j-arr[i])+solve(i+1,j+1,arr,dp));
    return dp[i][j]=ans;


}
int main()
{

    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    fastio();
    int t=1;
    cin>>t;
    while(t--)
    {
    int n;cin>>n;
    vector<int>arr(n);

    vector<vector<int>>dp(401,vector<int>(401,-1));
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    sort(arr.begin(),arr.end());
    cout<<solve(0,1,arr,dp)<<endl;
    }

    return 0;

}